An Effective Search in Unstructured Peer-to-Peer Overlay Networks

A peerto-peer (P2P) network is a distributed system in which peers employ distributed resources to perform a critical function in a decentralized fashion. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. The resultant networks may not perform searches efficiently and effectively because existing overlay topology construction algorithms often create unstructured P2P networks without performance guarantees. Distributed algorithms are used for constructing unstructured P2P networks such that peers having common preferences cluster together. Based on the file sharing pattern exhibiting the power-law property and poses rigorous performance guarantees. Our proposal clearly outperforms in terms of 1. The hop count of routing a query message 2.The successful ratio of resolving a query 3.The number of messages required for resolving a query and 4. The message overhead for maintaining and formatting the overlay.